UNBIASED COIN TOSSING WITH A BIASED COIN by
نویسنده
چکیده
PrQcedures are exhibited and analyzed for converting a sequence of iid Bernoulli variables with unknown mean p into a Bernoulli variable with mean 1/2. The efficiency of several procedures is studied.
منابع مشابه
On the Number of Switches in Unbiased Coin-tossing
A biased coin is tossed n times independently and sequentially. A “head” switch is a tail followed by a head and a “tail” switch is a head followed by a tail. Joint Laplace transform for the number of “head” switches and “tail” switches are given. For the total number of switches, the central limit theorem and the large deviation principle are established.
متن کاملFinding a most biased coin with fewest flips
We study the problem of learning the most biased coin among a set of coins by tossing the coins adaptively. The goal is to minimize the number of tosses to identify a coin i∗ such that Pr (coin i∗ is most biased) is at least 1 − δ for any given δ. Under a particular probabilistic model, we give an optimal algorithm, i.e., an algorithm that minimizes the expected number of tosses, to learn a mos...
متن کاملTossing a Biased Coin
When we talk about a coin toss, we think of it as unbiased: with probability one-half it comes up heads, and with probability one-half it comes up tails. An ideal unbiased coin might not correctly model a real coin, which could be biased slightly one way or another. After all, real life is rarely fair. This possibility leads us to an interesting mathematical and computational question. Is there...
متن کاملCompsci 650 Applied Information Theory 1.1 Identifying Whether a Coin Is Biased
1.1 Identifying Whether a Coin is Biased Lemma 1 We need O( 1 2 ) coin tosses to discern a biased coin with the probability of 1 2 − for head (and obviously with the probability of 12 + for tail), from an unbiased coin. Proof Consider two hypothesises H1 and H2 where respectively denote biased and unbiased coins. In other words, we have the following hypothesises: { H1 : biased p(h) = 12 − H2 :...
متن کاملCan Optimally-Fair Coin Tossing Be Based on One-Way Functions?
Coin tossing is a basic cryptographic task that allows two distrustful parties to obtain an unbiased random bit in a way that neither party can bias the output by deviating from the protocol or halting the execution. Cleve [STOC’86] showed that in any r round coin tossing protocol one of the parties can bias the output by Ω(1/r) through a “fail-stop” attack; namely, they simply execute the prot...
متن کامل